import java.util.ArrayList;


public class Node {
	public int nodeValue;
	public ShortestPath[] paths;
	ArrayList<Integer> neighborNodes = new ArrayList<Integer>();
	
	Node(int nodeValue, ArrayList<Integer> neighborNodes)
	{
		this.nodeValue = nodeValue;
		this.neighborNodes = neighborNodes;
		//paths = new ShortestPath[numberOfNodes];
	}

	
	public void addShortestPath(int destination, float metric)
	{
		ShortestPath shortestPath = new ShortestPath(destination, metric);
		paths[destination] = shortestPath;
	}
}

